Optimal decision indices for R&D project evaluation in the pharmaceutical industry: Pearson index versus Gittins index
نویسنده
چکیده
This paper examines issues related to various decision-based analytic approaches to sequential choice of projects, with special motivation from and application in the pharmaceutical industry. In particular, the Pearson index and Gittins index are considered as key strategic decision-making tools for the selection of R&D projects. It presents a proof of optimality of the Pearson index based on the Neyman–Pearson lemma. Emphasis is also given to how a project manager may differentiate between the two indices based on concepts from statistical decision theory. This work demonstrates and justifies the correct use of the Pearson index. 2006 Elsevier B.V. All rights reserved.
منابع مشابه
A Generalized Gittins Index for a Class of Multiarmed Bandits with General Resource Requirements
We generalise classical multi-armed and restless bandits to allow for the distribution of a (fixed amount of a) divisible resource among the constituent bandits at each decision point. Bandit activation consumes amounts of the available resource which may vary by bandit and state. Any collection of bandits may be activated at any decision epoch provided they do not consume more resource than is...
متن کاملA Novel Model in Optimal Decision Making to Investment in the Industry with Regard to the Role of Unique Value-Added to Optimizing the Total Expected Cost Index
The main aim of this study, introduce a model todetermine the optimal values of the index value to minimize thetotal expected cost index and also the best decision making inselecting the industry and the region for investment by investors.For this purpose, the technique of linear programming to determinethe optimal values of the index value is used. Finally, FuzzyTOPSIS technique to prioritize ...
متن کاملOptimistic Gittins Indices
Starting with the Thomspon sampling algorithm, recent years have seen a resurgence of interest in Bayesian algorithms for the Multi-armed Bandit (MAB) problem. These algorithms seek to exploit prior information on arm biases and while several have been shown to be regret optimal, their design has not emerged from a principled approach. In contrast, if one cared about Bayesian regret discounted ...
متن کاملRobust Control of the Multi-armed Bandit Problem
We study a robust model of the multi-armed bandit (MAB) problem in which the transition probabilities are ambiguous and belong to subsets of the probability simplex. We first show that for each arm there exists a robust counterpart of the Gittens index that is the solution to a robust optimal stopping-time problem. We then characterize the optimal policy of the robust MAB as a project-by-projec...
متن کاملQ-Learning for Bandit Problems
Multi-armed bandits may be viewed as decompositionally-structured Markov decision processes (MDP's) with potentially very large state sets. A particularly elegant methodology for computing optimal policies was developed over twenty ago by Gittins Gittins & Jones, 1974]. Gittins' approach reduces the problem of nding optimal policies for the original MDP to a sequence of low-dimensional stopping...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 177 شماره
صفحات -
تاریخ انتشار 2007